Image processing method and device

ABSTRACT

An image processing method and device for processing multiple rows of pixels of an image simultaneously with a single instruction. The processing includes selecting a pixel window having a plurality of pixels of an image spanning across multiple rows and columns, building vertical and horizontal load registers to include the plurality of pixels of the selected pixel window, and simultaneously processing selected pixels of the plurality of pixels included in the vertical and horizontal load registers using a single instruction, wherein the vertical and horizontal load registers are shifted when the selected pixels are processed. Accordingly, a method and device for efficient processing of an image is provided.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to processing an image. More particularly, the present invention relates to processing multiple rows of pixels of an image simultaneously with a single instruction.

2. Description of the Related Art

Generally, analyzing and processing of a selected pixel of an image includes building a pixel window having neighboring pixels of the selected pixel and processing the selected pixel with respect to the neighboring pixels in the pixel window. Accordingly, pixels in a pixel window are processed with respect to one another.

A typical hardware implementation of image processing utilizes a large buffer to store multiple pixels of image data. This requires the use of an application specific integrated circuit (ASIC) at a substantial cost for implementation. Further, a typical software based implementation of an imaging process requires multiple instruction cycles for building pixel windows, processing the pixel windows and loading pixels to the pixel windows, thereby consuming a higher processor bandwidth and requiring use of larger and faster processors. Unfortunately, the typical hardware and software solutions for image processing are not cost-efficient.

Accordingly, it is important to provide an image processing method and device without requiring high processor bandwidth. It is also important to provide an image processing method and device to eliminate the need to build pixel windows manually. Therefore, there is a need for executing image processing without having to utilize faster and larger processors.

SUMMARY OF THE INVENTION

The present invention provides a method of processing multiple rows of pixels of an image simultaneously with a single instruction. According to an aspect of the present invention, the processing includes building the multiple rows of pixels of the image in horizontal and vertical load registers that are arranged with respect to each other to correspond with the image. Further, the processing includes processing of multiple rows of pixels that are stored in non-sequential locations in a memory.

The present invention also provides a method of selecting pixel windows having a plurality of pixels of an image spanning across multiple rows and columns, building vertical and horizontal load registers to include the plurality of pixels of the selected pixel windows, and simultaneously processing selected pixels of the plurality of pixels included in the vertical and horizontal load registers using a single instruction, wherein the vertical and horizontal load registers are shifted when the selected pixels are processed. Further, the shifting of the vertical and horizontal load registers includes shifting a pixel in each of the horizontal load registers into at least one of the vertical load registers when the selected pixels are processed. The present invention also includes changing the plurality of pixels in the selected pixel windows each time the selected pixels are processed.

The present invention also provides an image processing device including a processor for processing multiple rows of pixels of an image simultaneously with a single instruction, where the multiple rows of pixels of the image are arranged in vertical and horizontal load registers. Further, the present invention provides a number of the horizontal and vertical load registers based on an imaging algorithm used.

Further, a method of the present invention includes building vertical and horizontal load registers to include a plurality of pixels of an image spanning across multiple rows and columns, and simultaneously processing selected pixels of the plurality of pixels spanning across the multiple rows using a single instruction, wherein most significant bits of each of the horizontal load registers are shifted into the vertical load registers when the selected pixels of the image are processed, and at least one of the vertical load registers is overwritten.

BRIEF DESCRIPTION OF THE DRAWINGS

These and/or other aspects and advantages of the invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 is a flow chart for illustrating an imaging process, according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating pixel windows, according to an embodiment of the present invention.

FIG. 3 is a diagram illustrating vertical and horizontal load registers of a pixel window, according to an embodiment of the present invention.

FIGS. 4A, 4B and 4C are diagrams illustrating pixel windows and corresponding vertical and horizontal load registers, according to an embodiment of the present invention.

FIGS. 5A, 5B and 5C are diagrams illustrating respective shifting operations of pixel windows of FIGS. 4A, 4B and 4C, according to an embodiment of the present invention.

FIGS. 6A and 6B are diagrams illustrating an exemplary pixel window and vertical and horizontal load registers, according to an embodiment of the present invention.

FIG. 7 is a diagram illustrating shifting operation of the pixel window of FIG. 6A, according to an embodiment of the present invention.

FIGS. 8A and 8B are diagrams illustrating pixel windows and corresponding vertical and horizontal load registers, according to an embodiment of the present invention.

FIGS. 9A and 9B are diagrams illustrating respective shifting operations of pixel windows of FIGS. 8A and 8B, according to an embodiment of the present invention.

FIG. 10 is a diagram illustrating a pixel window, according to an embodiment of the present invention.

FIG. 11 is a diagram illustrating vertical and horizontal registers of the pixel window of FIG. 10, according to an aspect of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the present embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below to explain the present invention by referring to the figures.

FIG. 1 is a flow chart illustrating an imaging process 200, according to an embodiment of the present invention. As shown in FIG. 1, process 200 includes operations 70, 80, 90 and 100. Accordingly, operation 70 includes selecting pixel windows having a plurality of pixels of an image spanning across multiple rows and columns. From operation 70, process 200 moves to operation 80, where vertical and horizontal load registers are built to include the plurality of pixels of the selected pixel windows. From operation 80, process 200 moves to operation 90, where selected pixels of the plurality of pixels included in the vertical and horizontal load registers are simultaneously processed using a single instruction. From operation 90, process 200 moves to operation 100, where the vertical and horizontal load registers are shifted when the selected pixels are processed in operation 90.

FIG. 2 is a diagram illustrating pixel windows, according to an embodiment of the present invention. FIG. 2 illustrates pixel windows 10 and 10 a having a plurality of pixels of an image spanning across multiple rows and columns. The pixel windows 10 a and 10 b are indicated using gray shading to respectively illustrate pixel contents of the pixel windows 10 a and 10 b. The pixel windows 10 and 10 a are constructed to include neighboring pixels of selected pixels 20 and 20 a, respectively, such that processing of pixels 20 and 20 a is implemented with respect to corresponding neighboring pixels. For example, the neighboring pixels with respect to pixel 20 are those pixels in rows above and below and pixels in columns to the right and left of pixel 20.

Referring to FIG. 2, the pixel window 10 and 10 a include pixels that span across 5 rows and 3 columns. While FIG. 2 is explained using the pixel windows 10 and 10 a having pixels that span across 5 pixel rows and 3 pixel columns, the present invention is not limited to this size of a pixel window. For example, 4 pixel rows by 4 pixel columns, 10 pixel rows by 4 pixel columns, etc., can be processed using the present invention. For ease of explanation, it is assumed that each pixel represents one bit, however, the present invention is not limited to such and can be implemented to process pixels having more than one bit.

As shown in FIG. 2, pixels of an image are located within different byte boundaries 30 a,30 b and 30 c in a memory (not shown). In FIG. 2, pixel window 10 a illustrates one of the subsequent positions of pixel window 10 when imaging process 200 of FIG. 1 is applied to pixel window 10, according to an embodiment of the present invention. The pixel window 10 moves or shifts across byte boundaries 30 a and 30 b as denoted by arrow 11 based on execution of imaging process 200 of FIG. 1. The operation resulting in the shifting of pixel window 10 is described in detail in the following paragraphs.

FIG. 3 is a diagram illustrating vertical and horizontal load registers of a pixel window, according to an embodiment of the present invention. In FIG. 3, vertical load registers 40 a and 40 b and horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e are loaded when pixel window 10 is to be processed according to imaging process 200 of FIG. 1. Specifically, horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e correspond to registers 1 through 5 (Reg 1 through Reg 5 in FIG. 3). The horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e contain all the pixels within byte boundaries 30 a and 30 b of FIG. 2 while vertical load registers 40 a and 40 b contain 2 pixel columns prior to byte boundary 30 a, which are the remaining pixels in pixel window 10. Most significant bits 60 of the horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e are placed closest to the vertical load registers 40 a and 40 b.

FIGS. 4A, 4B and 4C are diagrams illustrating pixel windows and corresponding vertical and horizontal load registers, according to an embodiment of the present invention. FIG. 4 illustrates application of operation 100 of FIG. 1 to pixel window 10 in FIG. 2. The vertical load registers 40 a and 40 b and the horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e in FIG. 3 are shifted when pixels in pixel window 10 are processed based on operation 90 of imaging process 200 in FIG. 1. Accordingly, when pixel window 10 is processed, pixels in vertical load register 40 a in FIG. 3 are overwritten by pixels in vertical load register 40 b. Accordingly, the contents of vertical load register 40 b are transferred to vertical load register 40 a. Further, horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e are also shifted to the left so that most significant bits 60 of the horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e are transferred to vertical load register 40 b.

FIG. 4A shows pixel window 10 b that results when pixel window 10 of FIG. 3 is processed and horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e and vertical load registers 40 a and 40 b are all shifted to the left according to imaging process 200 of FIG. 1. As denoted by arrow 11 in FIG. 2, once pixel window 10 is processed resulting in shifting of horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e and vertical load registers 40 a and 40 b, pixel window 10 b in FIG. 4A is constructed. Accordingly, pixel contents of horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e and vertical load registers 40 a and 40 b of FIG. 3 changes. As shown in FIG. 4A, horizontal load registers 51 a, 51 b, 51 c, 51 d and 51 e and vertical load registers 41 a and 41 b have different pixel contents than horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e and vertical load registers 40 a and 40 b of FIG. 3. Further, when pixel window 10 is processed and pixels in the horizontal load registers 50 a, 50 b, 50 c, 50 d and 50 e are shifted towards the vertical load registers 40 a and 40 b in FIG. 3, the resulting horizontal load registers 51 a, 51 b, 51 c, 51 d and 51 e are loaded with values that are not required for the processing of pixel window 10 b. For example, column A containing X values in FIG. 4A illustrates that the last bits of horizontal load registers 51 a, 51 b, 51 c, 51 d and 51 e contain values that are not required for processing pixel window 10 b.

Referring to FIG. 4B, when pixel window 10 b of FIG. 4A is processed, horizontal load registers 51 a, 51 b, 51 c, 51 d and 51 e and vertical load registers 41 a and 41 b shift to the left, resulting in pixel window 10 c as shown in FIG. 4B. Specifically, pixels in vertical load register 41 a of FIG. 4A are overwritten by pixels in vertical load register 41 b, and the most significant bits 60 of each horizontal load registers 51 a, 51 b, 51 c, 51 d and 51 e are loaded into vertical load register 41 b. As described above, as most significant bits 60 of the horizontal load registers continue to be shifted or transferred to at least one of the vertical load registers, columns A and B in FIG. 4B contain values that are not required for processing of pixel window 10 c. Similarly, when horizontal load registers 52 a, 52 b, 52 c, 52 d, 52 e and vertical load registers 42 a and 42 b in FIG. 4B are shifted to the left, horizontal load registers 53 a, 53 b, 53 c, 53 d, 53 e and vertical load registers 43 a and 43 b result as shown in FIG. 4C. Further, when imaging process 200 is applied to pixel window 10 c in FIG. 4B, pixel column and rows of pixel window 10 c changes to pixel window 10 d, according to an embodiment of the present invention. As illustrated in FIG. 4C, columns A, B and C contain values that are not required for processing pixel window 10 d.

FIGS. 5A, 5B and 5C are diagrams illustrating respective shifting operations of the pixel windows 10 b, 10 c and 10 d of FIGS. 4A, 4B and 4C, according to an embodiment of the present invention. FIG. 5 illustrates the shifting movement of pixel windows upon processing of pixel windows 10, 10 b and 10 c. Specifically, upon processing pixels in pixel window 10 b of FIG. 5A, content of pixel window 10 b is sequentially changed to pixel windows 10 c and 10 d in FIGS. 5B and 5C. As is evident from FIGS. 5A, 5B and 5C, pixel window 10 d in FIG. 5C is closer to byte boundary 30 b than pixel windows 10 b and 10 c of FIGS. 5A and 5B.

FIGS. 6A and 6B are diagrams illustrating an exemplary pixel window and vertical and horizontal load registers, according to an embodiment of the present invention. In FIG. 6, pixel window 10 e is formed of pixels in the last 3 pixel columns before the byte boundary 30 b in FIG. 2. As shown in FIG. 6A, horizontal load registers 54 a, 54 b, 54 c, 54 d and 54 e and vertical registers 44 a and 44 b are built for pixel window 10 e. Then, as shown in FIG. 6B, the vertical load registers 45 a and 45 b keep getting reloaded with pixels until shifting of all the pixels in horizontal load registers 54 a, 54 b, 54 c, 54 d and 54 e is completed. According to an embodiment of the present invention, an imaging process 90 is not executed because only vertical load registers 45 a and 45 b contain pixels while the most significant bits 60 of horizontal load registers 55 a, 55 b, 55 c, 55 d and 55 e are not loaded with pixels.

FIG. 7 is a diagram illustrating shifting operation of the pixel window 10 e of FIG. 6A, according to an embodiment of the present invention. As mentioned above, pixel window 10 e contains the far right three pixel columns within boundary 30 a. Accordingly, when operation 90 of FIG. 1 is applied to pixel window 10 e, corresponding horizontal load registers 54 a, 54 b, 54 c, 54 d and 54 e and vertical registers 44 a and 44 b are shifted to the left so that most significant bits 60 of 54 a, 54 b, 54 c, 54 d and 54 e in FIG. 6A are transferred to vertical register 44 b while pixels in vertical register 44 b are shifted to vertical register 44 a. Further, when pixel window 10 e of FIG. 6A having the last 3 pixel columns before byte boundary 30 b is processed and horizontal load registers 55 a, 55 b, 55 c, 55 d and 55 e and vertical load registers 45 a and 45 b of FIG. 6B are loaded, pixel columns subsequent to boundary byte 30 b continue to be loaded into the horizontal and vertical load registers as described below in relation to FIGS. 8A and 8B.

FIGS. 8A and 8B are diagrams illustrating pixel windows and corresponding vertical and horizontal load registers, according to an embodiment of the present invention. FIG. 8A shows pixel window 10 f having initial 2 pixel columns from pixel columns before byte boundary 30 b and 1 pixel column having pixels after byte boundary 30 b as shown in FIG. 9A. Further, FIG. 8B shows pixel window 10 g having 1 pixel column before byte boundary 30 b and 2 pixel columns after byte boundary 30 b as shown in FIG. 9B. As shown in FIGS. 8A and 8B, vertical and horizontal load registers are built for pixel window 10 f and pixel window 10 g, respectively. For pixel window 10 f, horizontal load registers 56 a, 56 b, 56 c, 56 d, 56 e are constructed, and for pixel window 10 g, horizontal load registers 57 a, 57 b, 57 c, 57 d, 57 e are constructed. Further, vertical load registers 46 a, 46 b in FIG. 8A and vertical load registers 47 a and 47 b are respectively constructed for pixel window 10 f and pixel window 10 g.

As mentioned above, FIG. 9A shows that pixel window 10 f has 2 initial pixel columns before byte boundary 30 b and 1 pixel column subsequent to byte boundary 30 b. And FIG. 9B shows that pixel window 10 g has the initial pixel column before byte boundary 30 b and 2 pixel columns after byte boundary 30 b. Accordingly, FIGS. 9A and 9B show shifting of pixel window 10 f to pixel window 10 g as imaging process 200 is applied to pixel window 10 f.

FIG. 10 is a diagram illustrating a pixel window, according to an embodiment of the present invention. As shown in FIG. 10, pixel window 10 h has 8 pixel rows by 3 pixel columns. As discussed above, byte boundaries 30 a, 30 b and 30 c represent byte boundaries in a memory within which pixels of an image are stored. While FIG. 10 is explained using pixel window 10 h having 8 pixel rows by 3 pixel columns, the present invention is not limited to processing a pixel window of that size.

FIG. 11 is a diagram illustrating vertical and horizontal registers of the pixel window of FIG. 10, according to an aspect of the present invention. As shown in FIG. 11, multiple pixel windows 10 h I, II, III and IV having 3 pixel columns by 5 pixel rows are constructed for pixel window 10 h of FIG. 10 that has 8 pixel rows by 3 pixel columns. Accordingly, for each of the multiple pixel windows 10 h, II, III and IV, a corresponding instruction is implemented to process pixel columns and rows in pixel windows 10 h I, II, III and IV where only pixel window 10 h IV shifts horizontal load registers 58 a, 58 b, 58 c, 58 d, 58 e, 58 f, 58 g and 58 h and vertical load registers 48 a and 48 b. This allows the present invention to implement efficient image processing by serially executing multiple pixel windows of a larger pixel window with corresponding instructions. As shown in FIG. 11, horizontal load registers 58 a, 58 b, 58 c, 58 d, 58 e, 58 f, 58 g and 58 h and vertical load registers 48 a and 48 b are constructed for pixel window 10 h of FIG. 10. Upon processing of pixels in pixel windows 10 h IV, most significant bits 60 of horizontal load registers 58 a, 58 b, 58 c, 58 d, 58 e, 58 f, 58 g and 58 h are shifted into vertical load register 48 b. Moreover, pixels in vertical load register 48 b are shifted to the left to overwrite pixels of vertical load register 48 a. Further, according to another embodiment of the present invention, pixel windows 10 h I, II, III and IV are processed simultaneously using a single instruction, causing the horizontal load registers 58 a, 58 b, 58 c, 58 d, 58 e, 58 f, 58 g and 58 h and the vertical load registers 48 a and 48 b to be shifted.

For example, central processing units such as, Tensilica XTensa T1050, ARC600 and ARC700, MIPS Pro series can be used to process multiple rows of pixels of an image simultaneously with a single instruction, according to the present invention. However, while the imaging process of the present invention can be utilizing Tensilica XTensa T1050, ARC600 and ARC700, MIPS Pro series central processing units, the present invention is not limited to use by these processing units.

Accordingly, the method of the present invention enables processing of multiple rows of pixels of an image simultaneously with a single instruction. The method further includes selecting a pixel window having a plurality of pixels of an image spanning across multiple rows and columns, building vertical and horizontal load registers to include the plurality of pixels of the selected pixel window, where selected pixels are simultaneously processed and the vertical and horizontal load registers are shifted when the selected pixels are processed.

The present invention also provides processing of multiple rows of pixels that are stored in non-sequential locations in a memory. Further, the present invention includes shifting most significant bits of each of the horizontal load registers into the vertical load registers when the multiple rows of pixels of the image are processed, where at least one of the vertical load registers is overwritten.

The present invention also provides an image processing device having a processor for processing multiple rows of pixels of an image simultaneously with a single instruction, wherein the multiple rows of pixels of the image are arranged in vertical and horizontal load registers. Further, the processing of the multiple rows of pixels of the image includes shifting of the pixels of the image that are arranged in the vertical and horizontal load registers when the multiple rows of pixels are processed.

Additionally, the present invention provides building vertical and horizontal load registers to include a plurality of pixels of an image spanning across multiple rows and columns, and simultaneously processing selected pixels of the plurality of pixels spanning across the multiple rows using a single instruction, wherein most significant bits of each of the horizontal load registers are shifted into the vertical load registers when the selected pixels of the image are processed, and at least one of the vertical load registers is overwritten.

Although a few embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents. 

1. A method, comprising: processing multiple rows of pixels of an image simultaneously with a single instruction.
 2. The method according to claim 1, wherein the processing includes building the multiple rows of pixels of the image in horizontal and vertical load registers that are arranged with respect to each other to correspond with the image.
 3. The method according to claim 1, wherein the processing includes processing of multiple rows of pixels that are stored in non-sequential locations in a memory.
 4. The method according to claim 2, wherein each of the pixels represents one bit.
 5. The method according to claim 2, further comprising: simultaneously shifting the horizontal and vertical load registers when the multiple rows of pixels of the image are processed.
 6. The method according to claim 2, wherein most significant bits of each of the horizontal load registers are shifted into the vertical load registers when the multiple rows of pixels of the image are processed, and at least one of the vertical load registers is overwritten.
 7. The method according to claim 2, wherein a number of the horizontal and vertical load registers provided is based on an imaging algorithm used.
 8. A method, comprising: selecting pixel windows having a plurality of pixels of an image spanning across multiple rows and columns; building vertical and horizontal load registers to include the plurality of pixels of the selected pixel windows; and simultaneously processing selected pixels of the plurality of pixels included in the vertical and horizontal load registers using a single instruction, wherein the vertical and horizontal load registers are shifted when the selected pixels are processed.
 9. The method according to claim 8, wherein the shifting of the vertical and horizontal load registers includes shifting a pixel in each of the horizontal load registers into at least one of the vertical load registers when the selected pixels are processed.
 10. The method according to claim 8, wherein the processing includes processing the plurality of pixels in the selected pixel window that are stored in non-sequential locations in a memory.
 11. The method according to claim 8, wherein the processing includes processing a pixel of the plurality of pixels, wherein the vertical and horizontal load registers are shifted when the pixel is processed.
 12. The method according to claim 8, wherein the processing includes changing the plurality of pixels in the selected pixel windows each time the selected pixels are processed.
 13. The method according to claim 8, wherein each of the pixels correspond to a bit, and the shifted pixel in each of the horizontal load registers correspond to most significant bits of the horizontal load registers.
 14. An image processing device, comprising: a processor for processing multiple rows of pixels of an image simultaneously with a single instruction, wherein the multiple rows of pixels of the image are arranged in vertical and horizontal load registers.
 15. The image processing device according to claim 14, wherein the processing includes processing of the multiple rows of pixels of the image that are stored in non-sequential locations in a memory.
 16. The image processing device according to claim 14, further comprising: shifting of the pixels of the image that are arranged in the vertical and horizontal load registers when the multiple rows of pixels are processed.
 17. The image processing device according to claim 14, wherein most significant bits of each of the horizontal load registers are shifted into the vertical load registers when the multiple rows of pixels of the image are processed, and at least one of the vertical load registers is overwritten.
 18. The image processing device according to claim 17, wherein the multiple rows of pixels of the image are included in a pixel window having pixel columns, and a content of the pixel window changes each time the multiple rows of pixels are processed.
 19. The image processing device according to claim 14, wherein a number of the horizontal and vertical load registers provided is based on an imaging algorithm used.
 20. A method, comprising: building vertical and horizontal load registers to include a plurality of pixels of an image spanning across multiple rows and columns; and simultaneously processing selected pixels of the plurality of pixels spanning across the multiple rows using a single instruction, wherein most significant bits of each of the horizontal load registers are shifted into the vertical load registers when the selected pixels of the image are processed, and at least one of the vertical load registers is overwritten. 